A Spectral Algorithm for Decoding Systematic BCH Codes

نویسندگان

چکیده

A novel method of spectral decoding for systematic BCH codes has been proposed. This a simple description and small computational complexity.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Support Vector Machine based Decoding Algorithm for BCH Codes

Modern communication systems require robust, adaptable and high performance decoders for efficient data transmission. Support Vector Machine (SVM) is a margin based classification and regression technique. In this paper, decoding of Bose Chaudhuri Hocquenghem codes has been approached as a multi-class classification problem using SVM. In conventional decoding algorithms, the procedure for decod...

متن کامل

Construction and decoding of BCH Codes

BCfi wdes over arbitrary finite ~~~nirnut:!tiv~ rings with identity arc drip& in LCF~S of their locator vector, The derivation is hased on the factorization of .I-’ -I over the unit ring of an ~tppropr~lt~ extension of the finite rin g. We prcscnt an ~~~ci~nt,d~~iu~ procedure, based on the modified Berlekamp Massey ;li~~~rithrn. for that codes. The code construction and the decoding proccdurcs ...

متن کامل

Errors-and-erasures Decoding of Bch Codes

We give a Grr obner basis algorithm for errors-and-erasures decoding of BCH codes that avoids computation of the modiied syndrome polynomial. The decoding problem is viewed as an instance of a more general interpolation problem. Our algorithm has the same computational complexity as the Berlekamp{Massey algorithm but is more eecient in hardware.

متن کامل

On the decoding of quasi-BCH codes

In this paper we investigate the structure of quasi-BCH codes. In the first part of this paper we show that quasi-BCH codes can be derived from Reed-Solomon codes over square matrices extending the known relation about classical BCH and Reed-Solomon codes. This allows us to adapt the Welch-Berlekamp algorithm to quasi-BCH codes. In the second part of this paper we show that quasi-BCH codes can ...

متن کامل

A Modified Step-By-Step Decoding for Binary BCH Codes

This study presents a modified and conceptually simple step-by-step decoding algorithm for binary cyclic BCH codes. Step-by-step decoding temporarily changes one information bit value at a time and then checks weather the weight of the error pattern decreases by computing the corresponding syndrome matrix determinant. Based on the channel information, this study propose a modified step-by-step ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IEEE Access

سال: 2022

ISSN: ['2169-3536']

DOI: https://doi.org/10.1109/access.2022.3215005